Simulated Annealing : Comparison of Vector and Parallel Implementations

نویسندگان

  • J. M. Voogd
  • D. de Kanter
  • L. O. Hertzberger
چکیده

2 Contents page 1 Introduction 3 1.1 Aim of the research 3 1.2 Background 3 2 Functional Aspects of the S.A. procedure 5 2.1 The sequential version 5 2.2 The vector version 6 2.3 The parallel version 6 3 Implementation Aspects 8 3.1 The vector version 8 3.1.1 Short description of vector processing 8 3.1.2 Description of the implementation 9 3.2 The parallel version 12 4 Time complexities 14 4.1 The sequential version 14 4.2 The vector version 15 4.2.1 Time complexity of the perturbation step 16 4.2.2 Time complexity of the potential energy update 16 4.2.3 Time complexity of the radius update 17 4.2.4 Total timecomplexity of the vector implementation 17 4.3 The parallel version 18 4.3.1 Functional decomposition 18 4.3.2 Systolic and hybrid S.A. 19 5 Results 20 5.1 The vector version 20 5.2 The parallel version 24 5.2.1 The tree decomposition 24 5.2.2 The systolic simulated annealing algorithm 26 5.3 Comparison of the vector and parallel implementations 29 6 Results of the crystallization experiments 31 7 Conclusions 34 7.1 Comparison of the vector and parallel implementations 34 7.2 Crystallization experiments 34 8 Future research 35 Acknowledgements 36 Reference list 36

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Traveling Salesman Problem Using Parallel Genetic Algorithm and Simulated Annealing

The traveling salesman problem (TSP) is to find a tour of a given number of cities (visiting each city exactly once and returning to the starting city) where the length of this tour is minimized. In this project, we implemented solutions to the traveling salesman problem using parallel genetic algorithm and simulated annealing, and compared the parallel performance and results of these two impl...

متن کامل

Comparison of vector and parallel implementations of the simulated annealing algorithm

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

متن کامل

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...

متن کامل

Crystallization on a Sphere Using the Simulated Annealing Algorithm Implemented on H.p.c. Systems

The research presented here is a comparison of the scalability of the simulated annealing algorithm on a vector super computer (CRAY Y-MP) with the scalability of a parallel implementation on a massively parallel transputer surface (Parsytec GCel with 512 nodes of type T805). Some results of the annealing procedure applied to the crystallization of Lennard-Jones particles on a sphere are presen...

متن کامل

Hybrid artificial immune system and simulated annealing algorithms for solving hybrid JIT flow shop with parallel batches and machine eligibility

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994